By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Search This Issue
Volume 9, Issue 4, pp. vii-1204

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Dedication

Michael L. Overton and Robert B. Schnabel

pp. vii-viii

BibTeX  Abstract ALLOW Full Text:  PDF

Linear Programming in O([n3/ln n]L) Operations

K. M. Anstreicher

pp. 803-812

BibTeX  Abstract Full Text:  PDF

Free Material Design via Semidefinite Programming: The Multiload Case with Contact Conditions

A. Ben-Tal, M. Kocvara, A. Nemirovski, and J. Zowe

pp. 813-832

BibTeX  Abstract Full Text:  PDF

A Global Convergence Analysis of an Algorithm for Large-Scale Nonlinear Optimization Problems

Paul T. Boggs, Anthony J. Kearsley, and Jon W. Tolle

pp. 833-862

BibTeX  Abstract Full Text:  PDF

Nonsymmetric Search Directions for Semidefinite Programming

Nathan Brixius, Florian A. Potra, and Rongqin Sheng

pp. 863-876

BibTeX  Abstract Full Text:  PDF

An Interior Point Algorithm for Large-Scale Nonlinear Programming

Richard H. Byrd, Mary E. Hribar, and Jorge Nocedal

pp. 877-900

BibTeX  Abstract Full Text:  PDF

Nonlinear Optimization, Quadrature, and Interpolation

H. Cheng, V. Rokhlin, and N. Yarvin

pp. 901-923

BibTeX  Abstract Full Text:  PDF

Two-Step Algorithms for Nonlinear Optimization with Structured Applications

Andrew R. Conn, Luís N. Vicente, and Chandu Visweswariah

pp. 924-947

BibTeX  Abstract Full Text:  PDF

Where Best to Hold a Drum Fast

Steven J. Cox and Paul X. Uhlig

pp. 948-964

BibTeX  Abstract Full Text:  PDF

A Global Convergence Theory for Dennis, El-Alem, and Maciel's Class of Trust-Region Algorithms for Constrained Optimization without Assuming Regularity

Mahmoud El-Alem

pp. 965-990

BibTeX  Abstract Full Text:  PDF

Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers

Michael C. Ferris, Robert Fourer, and David M. Gay

pp. 991-1009

BibTeX  Abstract Full Text:  PDF

On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data

Sharon Filipowski

pp. 1010-1040

BibTeX  Abstract Full Text:  PDF

On Modified Factorizations for Large-Scale Linearly Constrained Optimization

Nicholas Ian Mark Gould

pp. 1041-1063

BibTeX  Abstract Full Text:  PDF

A Trust Region Method for Parabolic Boundary Control Problems

C. T. Kelley and E. W. Sachs

pp. 1064-1081

BibTeX  Abstract Full Text:  PDF

Pattern Search Algorithms for Bound Constrained Minimization

Robert Michael Lewis and Virginia Torczon

pp. 1082-1099

BibTeX  Abstract Full Text:  PDF

Newton's Method for Large Bound-Constrained Optimization Problems

Chih-Jen Lin and Jorge J. Moré

pp. 1100-1127

BibTeX  Abstract Full Text:  PDF

Polyhedral Boundary Projection

O. L. Mangasarian

pp. 1128-1134

BibTeX  Abstract Full Text:  PDF

A Revised Modified Cholesky Factorization Algorithm

Robert B. Schnabel and Elizabeth Eskow

pp. 1135-1148

BibTeX  Abstract Full Text:  PDF

Parallel Adaptive GMRES Implementations for Homotopy Methods

Maria Sosonkina, Donald C. S. Allison, and Layne T. Watson

pp. 1149-1158

BibTeX  Abstract Full Text:  PDF

Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming

Stephen J. Wright

pp. 1159-1191

BibTeX  Abstract Full Text:  PDF

The Quasi-Cauchy Relation and Diagonal Updating

M. Zhu, J. L. Nazareth, and H. Wolkowicz

pp. 1192-1204

BibTeX  Abstract Full Text:  PDF